Generating Combinatorial Test Suite with Solution Space Tree for Configurations Testing of Sensors Networks

There are many results about generating pair-wise covering arrays with strength τ=2 have been reported, but fewer results are published for high-strength covering arrays with a higher-strength τ>2. In configuration testing of sensor networks, high-strength covering array is required to construct combinatorial test cases. To generate combinatorial test suite with higher-strength, a backtracking algorithms, which is based on solution space tree, is proposed in this paper by extending an existing pair-wise combinatorial test suite generation algorithm. In solution space tree model, each test case is represented as a path from the root to a leaf node in the tree. And proposed algorithm generates test cases one by one, by backtracking depth-first searching in the solution space tree. Finally, to assess the efficiency of proposed algorithm, computational comparison with other published methods is reported. Copyright © 2013 IFSA.